Parallel Computational Complexity in Statistical Physics
نویسنده
چکیده
We suggest the parallel computational complexity of simulating a system as a measure of its physical complexity. As an example, we present a parallel algorithm for simulating diiusion-limited aggregation (DLA) and calculate the algorithm's dynamic exponent z, which gives the scaling of the average running time with cluster radius. It is plausible that the algorithm attains the minimum possible value of the dynamic exponent in which case z characterizes the intrinsic history dependence of DLA. Complexity results of this type provide a fundamental basis on which a wide variety of models in statistical physics may be compared.
منابع مشابه
Complexity, parallel computation and statistical physics
The intuition that a long history is required for the emergence of complexity in natural systems is formalized using the notion of depth. The depth of a system is defined in terms of the number of parallel computational steps needed to simulate it. Depth provides an objective, irreducible measure of history applicable to systems of the kind studied in statistical physics. It is argued that phys...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملParallel dynamics and computational complexity of network growth models.
The parallel computational complexity or depth of growing network models is investigated. The networks considered are generated by preferential attachment rules where the probability of attaching a new node to an existing node is given by a power alpha of the connectivity of the existing node. Algorithms for generating growing networks very quickly in parallel are described and studied. The sub...
متن کاملNatural complexity, computational complexity and depth.
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a typical system state or history starting from simple initial conditions. The properties of depth are discussed and it is compared with other complexity measures. ...
متن کامل